A new formula for the minimum distance of an expander code
نویسندگان
چکیده
An expander code is a binary linear whose parity-check matrix the bi-adjacency of bipartite graph. We provide new formula for minimum distance such codes. also proof result that $2(1-\varepsilon) \gamma n$ lower bound given by an $(m,n,d,\gamma,1-\varepsilon)$
منابع مشابه
On the minimum distance graph of an extended Preparata code
The minimum distance graph of an extended Preparata code P (m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent.
متن کاملThe intractability of computing the minimum distance of a code
It is shown that the problem of computing the minimum distance of a binary linear code is NP-hard, and the corresponding decision problem is NP-complete. This result constitutes a proof of the conjecture of Berlekamp, McEliece, and van Tilborg, dating back to 1978. Extensions and applications of this result to other problems in coding theory are discussed.
متن کاملHardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code (or equivalently, the weight of the lightest codeword) is not approximable to within any constant factor in random polynomial time (RP), unless NP equals RP. Under the stronger assumption that NP is not contained in RQP (random quasi-polynomial time), we show that the minimum distance is not approximable to within the factor 2log(1 ) n, for any...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of algebra combinatorics discrete structures and applications
سال: 2022
ISSN: ['2148-838X']
DOI: https://doi.org/10.13069/jacodesmath.1111379